Minimal Representation of Uniform Recurrence Equations 1
نویسندگان
چکیده
We consider a system of uniform recurrence equations of dimension one. We show how the computation can be carried using minimal memory size with several synchronous processors. This result has applications in register minimization for digital circuitry and parallel simulation of timed event graphs.
منابع مشابه
Computations of Uniform Recurrence Equations Using Minimal Memory Size
We consider a system of uniform recurrence equations (URE) of dimension one. We show how its computation can be carried out using minimal memory size with several synchronous processors. This result is then applied to register minimization for digital circuits and parallel computation of task graphs.
متن کاملA Fast and Accurate Expansion-Iterative Method for Solving Second Kind Volterra Integral Equations
This article proposes a fast and accurate expansion-iterative method for solving second kind linear Volterra integral equations. The method is based on a special representation of vector forms of triangular functions (TFs) and their operational matrix of integration. By using this approach, solving the integral equation reduces to solve a recurrence relation. The approximate solution of integra...
متن کاملConverting Affine Recurrence Equations to Quasi-Uniform Recurrence Equations
Most work on the problem of synthesizing a systolic array from a system of recurrence equations is restricted to systems of uniform recurrence equations. Recently, researchers have begun to relax this restriction to include systems of affine recurrence equations. A system of uniform recurrence equations typically can be embedded in spacetime so that the distance between a variable and a depende...
متن کاملRevisiting the Decomposition of Karp, Miller and Winograd
This paper is devoted to the construction of multi-dimensional schedules f o r a system of uniform recurrence equations. W e show that this problem is dual to the problem oj com-putability of a system of uniform recurrence equations. W e propose a new study of the decomposition algorithm j r s t proposed by Karp, Milliller and Winograd: we base our implementation on linear programming resolutio...
متن کاملDecoupling the Dimensions of a System of Affine Recurrence Equations
Most work on the problem of synthesizing a systolic array from a system of recurrence equations is restricted to systems of uniform recurrence equations. In this paper, this restriction is relaxed to include systems of affine recurrence equations. A system of uniform recurrence equations typically can be embedded in spacetime so that the distance between a variable and a dependent variable does...
متن کامل